Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families

Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families

This paper provides a mathematical analysis of optimal algebraic manipulation detection (AMD) codes. We prove several lower bounds on the success probability of an adversary and we then give some combinatorial characterizations of AMD codes that meet the bounds with equality. These characterizations involve various types of generalized difference families. Constructing these difference families...

Algebraic manipulation detection codes

Algebraic manipulation detection codes are a cryptographic primitive that was introduced by Cramer et al. (Eurocrypt 2008). It encompasses several methods that were previously used in cheater detection in secret sharing. Since its introduction, a number of additional applications have been found. This paper contains a detailed exposition of the known results about algebraic manipulation detecti...

Jongsma Algebraic Manipulation Detection Codes

Combinatorial vs. Algebraic Characterizations of Completely Pseudo-Regular Codes

Given a simple connected graph Γ and a subset of its vertices C, the pseudodistance-regularity around C generalizes, for not necessarily regular graphs, the notion of completely regular code. We then say that C is a completely pseudoregular code. Up to now, most of the characterizations of pseudo-distance-regularity has been derived from a combinatorial definition. In this paper we propose an a...

Combinatorial Characterizations of Authentication Codes

In this paper, we prove two new combinatorial characterizations of authentication codes. Authentication codes without secrecy are characterized in terms of orthogonal arrays; and general authentication codes are characterized in terms of balanced incomplete block designs.